Reconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices

نویسنده

  • Lutz Kämmerer
چکیده

The evaluation of multivariate trigonometric polynomials at the nodes of a rank-1 lattice leads to a onedimensional discrete Fourier transform. Often, one is also interested in the reconstruction of the Fourier coefficients from their samples. We present necessary and sufficient conditions on rank-1 lattices allowing a stable reconstruction of trigonometric polynomials supported on hyperbolic crosses. In addition, we suggest approaches for determining suitable rank-1 lattices using a component-by-component algorithm. We present numerical results for reconstructing trigonometric polynomials up to spatial dimension 100.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconstructing hyperbolic cross trigonometric polynomials by sampling along generated sets

The evaluation of multivariate trigonometric polynomials at the nodes of a rank-1 lattice leads to a onedimensional discrete Fourier transform. Often, one is also interested in the reconstruction of the Fourier coefficients from their samples. We present necessary and sufficient conditions on rank-1 lattices allowing a stable reconstruction of trigonometric polynomials supported on hyperbolic c...

متن کامل

Multiple Rank-1 Lattices as Sampling Schemes for Multivariate Trigonometric Polynomials

We present a new sampling method that allows the unique reconstruction of (sparse) multivariate trigonometric polynomials. The crucial idea is to use several rank-1 lattices as spatial discretization in order to overcome limitations of a single rank-1 lattice sampling method. The structure of the corresponding sampling scheme allows for the fast computation of the evaluation and the reconstruct...

متن کامل

Approximation of multivariate functions by trigonometric polynomials based on rank-1 lattice sampling

In this paper, we present algorithms for the approximation of multivariate functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of functions in periodic Sobolev spaces of dominating mixed smoothness. Recently an algorithm for the trigonometric interpolation on generalized sparse grids...

متن کامل

Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling

In this paper, we present algorithms for the approximation of multivariate periodic functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of periodic functions of a certain smoothness. Our considerations include functions from periodic Sobolev spaces of generalized mixed smoothness. Re...

متن کامل

Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form

In this paper, we present error estimates for the approximation of multivariate periodic functions in periodic Hilbert spaces of isotropic and dominating mixed smoothness by trigonometric polynomials. The approximation is based on sampling of the multivariate functions on rank-1 lattices. We use reconstructing rank-1 lattices with generating vectors of Korobov form for the sampling and generali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Numerical Analysis

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2013